Invariable generation and the chebotarev invariant of a finite group

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response to a question in [KZ] we also bound the size of a randomly chosen set of elements of G that is likely to generate G invariably. Along the way we prove that every finite simple group is invariably generated by two elements.Comment: Improved versio

ESTSS at 20 years: "a phoenix gently rising from a lava flow of European trauma"

Roderick J. Ørner, who was President between 1997 and 1999, traces the phoenix-like origins of the European Society for Traumatic Stress Studies (ESTSS) from an informal business meeting called during the 1st European Conference on Traumatic Stress (ECOTS) in 1987 to its emergence into a formally constituted society. He dwells on the challenges of tendering a trauma society within a continent where trauma has been and remains endemic. ESTSS successes are noted along with a number of personal reflections on activities that give rise to concern for the present as well as its future prospects. Denial of survivors' experiences and turning away from survivors' narratives by reframing their experiences to accommodate helpers' theory-driven imperatives are viewed with alarm. Arguments are presented for making human rights, memory, and ethics core elements of a distinctive European psycho traumatology, which will secure current ESTSS viability and future integrity

Permutation groups, simple groups and sieve methods

We show that the number of integers n ≤ x which occur as indices of subgroups of nonabelian finite simple groups, excluding that of An-1 in An, is ∼ hx/log x, for some given constant h. This might be regarded as a noncommutative analogue of the Prime Number Theorem (which counts indices n ≤ x of subgroups of abelian simple groups). We conclude that for most positive integers n, the only quasiprimitive permutation groups of degree n are Sn and An in their natural action. This extends a similar result for primitive permutation groups obtained by Cameron, Neumann and Teague in 1982. Our proof combines group-theoretic and number-theoretic methods. In particular, we use the classification of finite simple groups, and we also apply sieve methods to estimate the size of some interesting sets of primes

The left intraparietal sulcus modulates the selection of low salient stimuli

Neuropsychological and functional imaging studies have suggested a general right hemisphere advantage for processing global visual information and a left hemisphere advantage for processing local information. In contrast, a recent transcranial magnetic stimulation study [Mevorach, C., Humphreys, G. W., & Shalev, L. Opposite biases in salience-based selection for the left and right posterior parietal cortex. Nature Neuroscience, 9, 740-742, 2006b] demonstrated that functional lateralization of selection in the parietal cortices on the basis of the relative salience of stimuli might provide an alternative explanation for previous results. In the present study, we applied a whole-brain analysis of the functional magnetic resonance signal when participants responded to either the local or the global levels of hierarchical figures. The task (respond to local or global) was crossed with the saliency of the target level (local salient, global salient) to provide, for the first time, a direct contrast between brain activation related to the stimulus level and that related to relative saliency. We found evidence for lateralization of salience-based selection but not for selection based on the level of processing. Activation along the left intraparietal sulcus (IPS) was found when a low saliency stimulus had to be selected irrespective of its level. A control task showed that this was not simply an effect of task difficulty. The data suggest a specific role for regions along the left IPS in salience-based selection, supporting the argument that previous reports of lateralized responses to local and global stimuli were contaminated by effects of saliency

Modular group algebras with almost maximal Lie nilpotency indices. I

Let K be a field of positive characteristic p and KG the group algebra of a group G. It is known that, if KG is Lie nilpotent, then its upper (or lower) Lie nilpotency index is at most |G'|+1, where |G'| is the order of the commutator subgroup. The authors have previously determined the groups G for which this index is maximal and here they determine the G for which it is `almost maximal', that is the next highest possible value, namely |G'|-p+2

Generalized Shortest Path Kernel on Graphs

We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification problem, we consider the task of classifying random graphs from two well-known families, by the number of clusters they contain. We verify empirically that the generalized shortest path kernel outperforms the original shortest path kernel on a number of datasets. We give a theoretical analysis for explaining our experimental results. In particular, we estimate distributions of the expected feature vectors for the shortest path kernel and the generalized shortest path kernel, and we show some evidence explaining why our graph kernel outperforms the shortest path kernel for our graph classification problem.Comment: Short version presented at Discovery Science 2015 in Banf

Generation of second maximal subgroups and the existence of special primes

Let G be a finite almost simple group. It is well known that G can be generated by three elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of G. In this paper, we consider subgroups at the next level of the subgroup lattice—the so-called second maximal subgroups. We prove that with the possible exception of some families of rank 1 groups of Lie type, the number of generators of every second maximal subgroup of G is bounded by an absolute constant. We also show that such a bound holds without any exceptions if and only if there are only finitely many primes r for which there is a prime power q such that (q r − 1)/(q − 1) is prime. The latter statement is a formidable open problem in Number Theory. Applications to random generation and polynomial growth are also given